public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        binaryTree.preOrder(root);
        System.out.println();
        binaryTree.inOrder(root);
        System.out.println();
        binaryTree.postOrder(root);
        System.out.println();
        binaryTree.size(root);
        System.out.println("节点个数：" + BinaryTree.countSize);
        System.out.println("节点个数：" + binaryTree.nodeSize(root));
        binaryTree.getLeafNodeCount1(root);
        System.out.println("叶子节点个数：" + BinaryTree.leafCount);
        System.out.println("叶子节点个数：" + binaryTree.getLeafNodeCount2(root));
        System.out.println("第K层节点个数：" + binaryTree.getKLevelNodeCount(root,3));
        System.out.println("树的高度：" + binaryTree.getHeight(root));
        BinaryTree.TreeNode find = binaryTree.find(root,'E');
        System.out.println(find.val);
        binaryTree.levelOrder(root);
        System.out.println();
        System.out.println(binaryTree.isCompleteTree(root));
    }

}
